Minimum Dilation Triangulations for the Regular n - gon
نویسنده
چکیده
A T E X-Tips ausgeholfen hat.
منابع مشابه
Minimum Dilation Triangulations
Given a planar graph G, the graph theoretic dilation of G is defined as the maximum ratio of the shortest-path distance and the Euclidean distance between any two vertices of G. Given a planar point set S, the graph theoretic dilation of S is the minimum graph theoretic dilation that any triangulation of S can achieve. We study the graph theoretic dilation of the regular n-gon. In particular, w...
متن کاملCounting triangulations of balanced subdivisions of convex polygons
We compute the number of triangulations of a convex k-gon each of whose sides is subdivided by r − 1 points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as k and/or r tend to infinity. We connect these results with the question of finding the planar set of n points in general position that has the minimum possible number of tria...
متن کاملCounting Triangulations of Some Classes
We compute the number of triangulations of a convex k-gon each of whose sides is subdivided by r−1 points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as k and/or r tend to infinity. We connect these results with the question of finding the planar set of points in general position that has the minimum possible number of triangul...
متن کاملThe Minimum Distance Energy for Polygonal Unknots
This paper investigates the energy UMD of polygonal unknots. It provides equations for finding the energy for any planar regular n-gon and for any m-gon, where the vertices lie on the vertices of a regular m 2 -gon and on the midpoints of each edge. In addition, we show that a regular 4-gon minimizes the energy for any quadrilateral. Finally, this paper includes a proof showing that if we have ...
متن کاملEfficient Regular Polygon Dissections
We study the minimum number g(m,n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that dn/2e − 2 ≤ g(4, n) ≤ n 2 + o(n) and dn/4e ≤ g(n, 4) ≤ n 2 + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the min...
متن کامل